#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define XH(i,a,b) for(int i = a; i < b; ++i)
#define XXH(i,b,a) for(int i = b; i >= a; --i)
#define Module 1e9+7
int tInt;ll tll;string tString;char tChar;
vector<int>tIVector;

int n;
int trees[1010];
int approximates[100100];

void solve(){
  
}

int main(){
  #ifndef ONLINE_JUDGE
    auto start_clock = clock();
    //freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
  #endif

  cin>>n;
  XH(i, 0, n){
    scanf("%d", &trees[i]);
  }
  fill(approximates,approximates + 100010, 1);
  XH(i,2,100001){
    int number = i;
    number += i;
    while(number < 100001){
      approximates[number]++;
      number+=i;
    }
  }
  /* XH(i,1,100){ */
  /*   printf("i=%d, app = %d\n",i,approximates[i]); */
  /* } */
  solve();
  
  #ifndef ONLINE_JUDGE
    auto end_clock = clock();
    cout<<"runtime: "<<end_clock - start_clock<<"ms"<<endl;
  #endif
  return 0;
}
